Algol-like Language
نویسنده
چکیده
We present a denotational semantics for an Algol-like language Alg, which is fully abstract for the second order subset of Alg. This constitutes the rst signiicant full abstraction result for a block structured language with local variables. As all the published`test equivalences' 13, 8, 23] for Algol-like languages are contained in the second order subset, they can all be validated (easily) in our denotational model. The general technique for our model construction|namely`relationally structured locally complete partial orders' with`relation preserving locally continuous functions'|has already been developed in 13], but our particular model diiers from the one in 13] in that we now use a larger set of relations. In a certain sense it is thèlargest possible' set of relations, an idea which we have successfully used in 32] to obtain a fully abstract model for the second order subset of the functional language PCF 26]. The overall structure of our full abstraction proof is also taken from 32], but for the single parts of the proof we had to solve considerable new problems which are speciic to the imperative (Algol-like) setting.
منابع مشابه
Algol-like Language (preliminary Report)
We present a denotational semantics for an Algol-like language Alg which is fully abstract for the second order subset of Alg. This constitutes the rst signiicant full abstraction result for a block structured language with local variables. In this preliminary report we concentrate on the construction of the denotational model and on the main ideas of the full abstraction proof. For more backgr...
متن کاملParametric Sheaves for modelling Store Locality
In this paper, we bring together two important ideas in the semantics of Algol-like imperative programming languages. One is that program phrases act on xed sets of storage locations. The second is that the information of local variables is hidden from client programs. This involves combining sheaf theory and parametricity to produce new classes of sheaves. We deene the semantics of an Algol-li...
متن کامل1970, A FORTRAN coded regular expression Compiler for IBM ..
REC (Regular Expression Compiler) is a concise programming language which allows students to write programs without knowledge of the complicated syntax of languages like FORTRAN and ALGOL. The language is recursive and contains only four elements for control. This paper describes an interpreter of REC written in FORTRAN.
متن کاملFull Abstraction for the Second Order Subset of an Algol-Like Language
We present a denotational semantics for anAlgol like languageAlg which is fully abstract for the second order subset of Alg This constitutes the rst signi cant full abstraction result for a block structured language with local variables As all the published test equivalences for Algol like languages are contained in the second order subset they can all be validated easily in our denotational mo...
متن کاملOn the Semantics of the Bad-Variable Constructor in Algol-like Languages
The fully abstract games model of Reynolds’s Idealized Algol is adapted to provide a characterization of the language without the “bad variable constructor” mkvar. The model shows that the addition of mkvar to the language is conservative for observational equivalence but not for the observational preorder.
متن کامل